Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs
نویسندگان
چکیده
Concurrent non-malleable zero-knowledge (CNMZK) considers the concurrent execution of zero-knowledge protocols in a setting where the attacker can simultaneously corrupt multiple provers and verifiers. We provide the first construction of a CNMZK protocol that, without any trusted set-up, remains secure even if the attacker may adaptively select the statements to receive proofs of; previous works only handle scenarios where the statements are fixed at the beginning of the execution, or chosen adaptively from a restricted set of statements.
منابع مشابه
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
Ever since the invention of Zero-Knowledge by Goldwasser, Micali, and Rackoff [1], Zero-Knowledge has become a central building block in cryptography with numerous applications, ranging from electronic cash to digital signatures. The properties of Zero-Knowledge range from the most simple (and not particularly useful in practice) requirements, such as honest-verifier zero-knowledge to the most ...
متن کاملAdaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool and widely used in many other cryptographic applications. However, when stand-alone zero-knowledge protocols are used in complex environments, e.g., the Internet, the basic properties may not be sufficient. This is why re...
متن کاملOn Adaptively Secure Protocols
Adaptive security captures the capability of an adversary to adaptively affect a system during the course of its computation based on partial information gathered. In this work, we explore the theoretical complexity of achieving adaptive security in two settings: 1. Adaptive UC-Secure Computation: We provide a roundefficient compiler that transforms any stand-alone semi-honest adaptively secure...
متن کاملThe Non-interactive Equivocable Non-malleable Commitment and its Applications
Under the assumption of the existence of one-way functions, we prove that it is possible to construct the non-interactive equivocable non-malleable commitment scheme. Especially importantly, we succeed in implementing concurrent zero-knowledge using our commitment scheme, analysising properties of this concurrent zero-knowledge proof system, comparing it with the existed concurrent zero-knowled...
متن کامل4-Round Concurrent Non-Malleable Commitments
The round complexity of non-malleable commitments and non-malleable zero knowledge arguments has been an open question for long time. Very recent results of Pass [TCC 2013] and of Goyal et al. [FOCS 2014, STOC 2016], gave almost definitive answers. In this work we show how to construct round-efficient non-malleable protocols via compilers. Starting from protocols enjoying limited non-malleabili...
متن کامل